Least - Perimeter Partitions of the Sphere

نویسنده

  • Conor Quinn
چکیده

We consider generalizations of the honeycomb problem to the sphere S and seek the perimeter-minimizing partition into n regions of equal area. We provide a new proof of Masters’ result that three great semicircles meeting at the poles at 120 degrees minimize perimeter among partitions into three equal areas. We also treat the case of four equal areas, and we prove under various hypotheses that the tetrahedral arrangement of four equilateral triangles meeting at 120 degrees minimizes perimeter among partitions into four equal areas.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimal Perimeter for N Confined Deformable Bubbles of Equal Area

Candidates to the least perimeter partition of various polygonal shapes into N planar connected equal-area regions are calculated for N 6 42, compared to partitions of the disc, and discussed in the context of the energetic groundstate of a two-dimensional monodisperse foam. The total perimeter and the number of peripheral regions are presented, and the patterns classified according to the numb...

متن کامل

Minimal connected partitions of the sphere

We consider the soap bubble problem on the sphere S2, which seeks a perimeter-minimizing partition into n regions of given areas. For n = 4, it is conjectured that a tetrahedral partition is minimizing. We prove that there exists a unique tetrahedral partition into given areas, and that this partition has less perimeter than any other partition dividing the sphere into the same four connected a...

متن کامل

The Least-Perimeter Partition of a Sphere into Four Equal Areas

We prove that the least-perimeter partition of the sphere into four regions of equal area is a tetrahedral partition.

متن کامل

Calculations of the minimal perimeter for N deformable bubbles of equal area confined in an equilateral triangle

Candidates to the least perimeter partition of an equilateral triangle into N planar connected regions are calculated for N ≤ 45. A Voronoi construction is used to randomly create the candidates and then the perimeter of each is found with the Surface Evolver. The optimal configuration for each N has no more than one defect pair, and its location is determined by the proximity of N to a triangu...

متن کامل

A note on non lower semicontinuous perimeter functionals on partitions

We consider isotropic non lower semicontinuous weighted perimeter functionals defined on partitions of domains in R. Besides identifying a condition on the structure of the domain which ensures the existence of minimizing configurations, we describe the structure of such minima, as well as their regularity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005